Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
191	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
192	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm Joachim Giesen∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:32 Diagrams Discrete geometry Voronoi diagram Triangulation Medial axis Delaunay triangulation Polyhedron Proximity problems Convex hull Geometry Computational geometry Mathematics
193	Non-clairvoyant Scheduling of Multiple Bag-of-tasks Applications Henri Casanova1 , Matthieu Gallet2,3 , and Fr´ed´eric Vivien3,1,2 1 2 Add to Reading List Source URL: navet.ics.hawaii.edu Language: English - Date: 2010-06-23 21:57:16 Mathematics Throughput Approximation algorithm Job shop scheduling Mathematical optimization Scheduling Algorithm Operations research Applied mathematics Theoretical computer science
194	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Fault Tolerant Clustering Revisited Nirman Kumar∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Approximation algorithms Computational complexity theory Cluster analysis Data mining Geostatistics K-means clustering K-medians clustering Metric k-center Algorithm Mathematics Theoretical computer science Statistics
195	Under-Approximation Refinement for Classical Planning Manuel Heusner and Martin Wehrle and Florian Pommerening and Malte Helmert University of Basel, Switzerland {manuel.heusner,martin.wehrle,florian.pommerening,malte.he Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2014-03-24 03:34:57 Planning Heuristic function Automated planning and scheduling Mind Science Neuropsychology Algorithm Mathematical logic Theoretical computer science
196	What is the nearest neighbor in high dimensional spaces? Alexander Hinneburgy Charu C. Aggarwalz y Institute of Computer Science, University of Halle Add to Reading List Source URL: fusion.cs.uni-magdeburg.de Language: English - Date: 2002-10-04 04:14:52 Artificial intelligence Machine learning Numerical analysis Approximation algorithms Data mining Nearest neighbor search K-nearest neighbor algorithm R-tree IDistance Information science Search algorithms Mathematics
197	Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-03-29 07:21:24 Operations research Computational complexity theory Convex optimization Linear programming Polyhedron Mathematical optimization Approximation algorithm Simplex algorithm Algorithm Theoretical computer science Applied mathematics Mathematics
198	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
199	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Maximal Covering by Two Isothetic Unit Squares Priya Ranjan Sinha Mahapatra ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:05:31 Proof theory Diophantine approximation Dynamic programming Earley parser Euclidean algorithm Mathematics Mathematical analysis Mathematical logic
200	Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Applied mathematics Convex optimization Linear programming Constraint Candidate solution Algorithm Linear programming relaxation LP-type problem Mathematical optimization Operations research Mathematics

UPDATE